Solving Binary CSP Using Computational Systems
نویسندگان
چکیده
منابع مشابه
Solving Binary CSP Using ComputationalSystemsCarlos
In this paper we formalise CSP solving as an inference process. Based on the notion of Computational Systems we associate actions with rewriting rules and control with strategies that establish the order of application of the inferences. The main contribution of this work is to lead the way to the design of a formalism allowing to better understand constraint solving and to apply in the domain ...
متن کاملBinary CSP Solving as an Inference Process
We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving Binary CSP once they are expressed as rewriting rules coordinated by strategies.
متن کاملBinary CSP Using ComputationalSystemsCarlos
In this paper we formalise CSP solving as an inference process. Based on the notion of Computational Systems we associate actions with rewriting rules and control with strategies that establish the order of application of the inferences. The main contribution of this work is to lead the way to the design of a formalism allowing to better understand constraint solving and to apply in the domain ...
متن کاملSolving the Car-Sequencing Problem as a Non-binary CSP
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solution time for this problem, different ordering heuristics were implementented. The results obtained by using these methods are compared on the instances reported in the CSPLib.
متن کاملHybrid Solving for CSP
Constraint Satisfaction Problems (CSP) [27] provide a general framework for the modeling of many practical applications (planning, scheduling, time tabling,...). Many examples of such constraint satisfaction problems can be found in [12]. A CSP is usually defined by a set of variables associated to domains of possible values and by a set of constraints. We only consider here CSP over finite dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1996
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00042-8